You are here: irt.org | FOLDOC | complete graph
A graph which has a link between every pair of nodes. A complete bipartite graph can be partitioned into two subsets of nodes such that each node is joined to every node in the other subset.
(1995-01-24)
Nearby terms: Complementary Metal Oxide Semiconductor « complementary nondeterministic polynomial « complete « complete graph » complete inference system » complete lattice » complete metric space
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL